Processes and the denotational semantics of concurrency

Full abstraction of a denotational semantics for real - time concurrency

We present a fully abstract semantics for real-time distributed computing of the Ada and OCCAM kind in a denotational style. This semantics tums tennination, communication along channels, and the time communication takes place, into observabIes. Yet it is the coarsest semantics to do so which is syntax-directed (this is known as full abstraction). It extends the linear history semantics for CSP...

Denotational Semantics and Refinement

Denotational descriptions are frequently presented in terms of a sequence of descriptions of programming languages of increasing complexity. We discuss a formal approach to the study of such description sequences in terms of a refinement relation, showing how the informal use made of this approach in tutorial introductions to denotational semantics may be formally justified.

Operational and Denotational Semantics

The types are , ::= Nat ∣ → . All the terms in the language come with explicit types. In particular, we assume an infinite, countable set of variables of each type , and write x for a variable of type . The terms t of type (in short, t : ) are defined by induction on their size by : – every variable x is of type ; – if N : , then x ⋅N is a term of type → ; – if M : → and N : , then MN is a term...

Chapter 24 On Relating Denotational and Operational Semantics for Programming Languages with Recursion and Concurrency

Revisiting Elementary Denotational Semantics

We present a semantics for an applied call-by-value λ-calculus that is compositional, extensional, and elementary. We present four di‚erent views of the semantics: 1) as a relational (big-step) semantics that is not operational but instead declarative, 2) as a denotational semantics that does not use domain theory, 3) as a non-deterministic interpreter, and 4) as a variant of the intersection t...